Probabilistic analysis of the subset-sum problem
نویسندگان
چکیده
منابع مشابه
Multidimensional Subset Sum Problem
This thesis explores new modifications to the successful LLL approach to solving the Subset Sum problem. This work is an optimization of the matrix representation of an instance. Traditionally, the basis matrix contained only one column with set elements and the sum. In this thesis we suggest having several data columns (thus introducing multidimensionality). This allows us to reduce the size o...
متن کاملA Wave Analysis of the Subset Sum Problem
This paper introduces the wave model, a novel approach on analyzing the behavior of GAs. Our aim is to give techniques that have practical relevance and provide tools for improving the performance of the GA or for discovering simple and effective heuristics on certain problem classes. The wave analysis is the process of building wave models of problem instances of a problem class and extracting...
متن کاملStochastic Analysis of Greedy Algorithms for the Subset Sum Problem
The subset sum problem is the selection of a subset of items from a given ground set summing up as close as possible to a given capacity value. In this paper we deal with the proba-bilistic analysis of greedy algorithms for a subset sum problem where the items are drawn from a discrete uniform distribution. Starting from results by ddAtri and Puech we derive expected values for several crucial ...
متن کاملApproximability of the Subset Sum Reconfiguration Problem
The subset sum problem is a well-known NP-complete problem in which we wish to find a packing (subset) of items (integers) into a knapsack with capacity so that the sum of the integers in the packing is at most the capacity of the knapsack and at least a given integer threshold. In this paper, we study the problem of reconfiguring one packing into another packing by moving only one item at a ti...
متن کاملQuantum Algorithms for the Subset-Sum Problem
This paper introduces a subset-sum algorithm with heuristic asymptotic cost exponent below 0.25. The new algorithm combines the 2010 Howgrave-Graham–Joux subset-sum algorithm with a new streamlined data structure for quantum walks on Johnson graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1982
ISSN: 0166-218X
DOI: 10.1016/0166-218x(82)90055-5